A stochastic telegraph equation from the six-vertex model
نویسندگان
چکیده
منابع مشابه
Studying the Six-Vertex Model with the Yang-Baxter Equation
We study the six-vertex model, a two-dimensional model of ferroelectric solids, originally solved by Lieb [2] in a restricted case by Bethe ansatz. We construct the phase diagram by deriving and solving the Yang-Baxter equations [5], introduced in statistical physics by Baxter to generate integrable models in two-dimensions. We discuss the significance of the Yang-Baxter equation and comment on...
متن کاملRepresentation Theory and Baxter's Tq Equation for the Six-vertex Model. a Pedagogical Overview
Recent years have seen renewed interest in the six and eight-vertex model at rational coupling values, that is when the crossing parameter is evaluated at roots of unity. Deguchi, Fabricius and McCoy pointed out that the extra degeneracies in the spectrum of the six-vertex transfer matrix can be understood in terms of an affine symmetry algebra in certain commensurate spin-sectors [1]. This rai...
متن کاملFractal structure of the six-vertex model
A fractal set which corresponds to the six-vertex model has been obtained and a relationship between the free energy of the six-vertex model and the fractal dimension of the fractal set was established. Notions which correspond to the transfer matrix and the n-equivalence has been found in the area of the fractal geometry. This correspondence can be generalized to the case of the models suitabl...
متن کاملApproximability of the Six-vertex Model
In this paper we take the rst step toward a classi cation of the approximation complexity of the six-vertex model, an object of extensive research in statistical physics. Our complexity results conform to the phase transition phenomenon from physics. We show that the approximation complexity of the six-vertex model behaves dramatically di erently on the two sides separated by the phase transiti...
متن کاملComplexity classification of the six-vertex model
We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is explicit.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2019
ISSN: 0091-1798
DOI: 10.1214/19-aop1356